Reconstructing Functions from Random Samples

نویسندگان

  • Steve Ferry
  • Konstantin Mischaikow
  • Vidit Nanda
چکیده

From a sufficiently large point sample lying on a compact Riemannian submanifold of Euclidean space, one can construct a simplicial complex which is homotopy-equivalent to that manifold with high confidence. We describe a corresponding result for a Lipschitz-continuous function between two such manifolds. That is, we outline the construction of a simplicial map which recovers the induced maps on homotopy and homology groups with high confidence using only finite sampled data from the domain and range, as well as knowledge of the image of every point sampled from the domain. We provide explicit bounds on the size of the point samples required for such reconstruction in terms of intrinsic properties of the domain, the co-domain and the function. This reconstruction is robust to certain types of bounded sampling and evaluation noise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of Distinguishing Markov Random Fields

Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bounded degree from independent samples from the Markov random field. These results require observing samples of the distribution at all nodes of the graph. It was heuristically recognized that the pr...

متن کامل

Reconstructing Signals with Finite Rate of Innovation from Noisy Samples

A signal is said to have finite rate of innovation if it has a finite number of degrees of freedom per unit of time. Reconstructing signals with finite rate of innovation from their exact average samples has been studied in SIAM J. Math. Anal., 38(2006), 1389-1422. In this paper, we consider the problem of reconstructing signals with finite rate of innovation from their average samples in the p...

متن کامل

MLE-induced Likelihood for Markov Random Fields

Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood [2] and Laplace approximation [33]. In this paper, we propose a novel way of approximating the likelihood function through first approximating the marginal likelihood functions of individua...

متن کامل

Identifying Communities and Key Vertices by Reconstructing Networks from Samples

Sampling techniques such as Respondent-Driven Sampling (RDS) are widely used in epidemiology to sample "hidden" populations, such that properties of the network can be deduced from the sample. We consider how similar techniques can be designed that allow the discovery of the structure, especially the community structure, of networks. Our method involves collecting samples of a network by random...

متن کامل

A maximum entropy approach for property prediction of random microstructures

The task of reconstruction of microstructures from their limited description is posed as a maximum entropy (MaxEnt) problem. Microstructural descriptors are taken in the form of volume fractions, correlation functions and grain sizes. Morphological and size quantifications are used as features of microstructure and samples consistent with these features are reconstructed. The nonuniqueness of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013